Partition theorems for factorisations of ascending parameter words
نویسندگان
چکیده
We prove, in primitive recursive arithmetic, an extension of a theorem established by Milliken and independently by Neget~il and R6dl on partitions of fixed rank partitions of a finite set. In this way we depict the preservation of structure under partitions of the outcomes of substitution systems, which can also undergo various stage transitions.
منابع مشابه
Homogeneous factorisations of complete multipartite graphs
A homogeneous factorisation of a graph is a partition of its arc set such that there exist vertex transitive subgroups M < G 6 Aut(Γ) with M fixing each part of the partition setwise and G preserving the partition and transitively permuting the parts. In this paper we study homogeneous factorisations of complete multipartite graphs such that M acts regularly on vertices. We provide a necessary ...
متن کاملFactorisations for Partition Functions of Random Hermitian Matrix Models
Factorisations of partition functions of random Hermitian matrix models 1 2 Abstract The partition function ZN ; for Hermitian-complex matrix models can be expressed as an explicit integral over R N ; where N is a positive integer. Such an integral also occurs in connexion with random surfaces and models of two dimensional quantum gravity. We show that ZN can be expressed as the product of two ...
متن کاملPartition Theorems for Spaces of Variable Words
Furstenberg and Katznelson applied methods of topological dynamics to Ramsey theory, obtaining a density version of the Hales-Jewett partition theorem. Inspired by their methods, but using spaces of ultrafilters instead of their metric spaces, we prove a generalization of a theorem of Carlson about variable words. We extend this result to partitions of finite or infinite sequences of variable w...
متن کاملLyndon Words and Singular Factors of Sturmian Words
Two diierent factorizations of the Fibonacci innnite word were given independently in 10] and 6]. In a certain sense, these factorizations reveal a self-similarity property of the Fibonacci word. We rst describe the intimate links between these two factorizations. We then propose a generalization to characteristic sturmian words. R esum e. Deux factorisations du mot de Fibonacci ont et e donn e...
متن کاملHomogeneous factorisations of Johnson graphs
For a graph Γ, subgroups M < G 6 Aut(Γ), and an edge partition E of Γ, the pair (Γ, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on Γ and fixes setwise each part of E , while G permutes the parts of E transitively. A classification is given of all homogeneous factorisations of finite Johnson graphs. There are three infinite families and nine sporadic examples.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 197-198 شماره
صفحات -
تاریخ انتشار 1999